Grr: Generating Random RDF
نویسندگان
چکیده
This paper presents GRR, a powerful system for generating random RDF data, which can be used to test Semantic Web applications. GRR has a SPARQL-like syntax, which allows the system to be both powerful and convenient. It is shown that GRR can easily be used to produce intricate datasets, such as the LUBM benchmark. Optimization techniques are employed, which make the generation process efficient and scalable.
منابع مشابه
Generating RDF for Application Testing
Application testing is a critical component of application development. Testing of Semantic Web applications requires large RDF datasets, conforming to an expected form or schema, and preferably, to an expected data distribution. Finding such datasets often proves impossible, while generating input datasets is often cumbersome. The GRR (Generating Random RDF) system is a convenient, yet powerfu...
متن کاملGenerating examples of paths summarizing RDF datasets
As datasets become too large to be comprehended directly, a need for data summarization arises. A data summary can present typical patterns commonly found in a dataset, from which high-level understanding of the data can be obtained. Nonetheless, such abstract understanding can be improved by providing concrete examples of the summary patterns. If possible, the chosen examples should be diverse...
متن کاملGrr Obner Bases of Lattices, Corner Polyhedra, and Integer Programming
There are very close connections between the arithmetic of integer lattices, algebraic properties of the associated ideals, and the geometry and the combinatorics of corresponding polyhedra. In this paper we investigate the generating sets (\Grr obner bases") of integer lattices that correspond to the Grr obner bases of the associated binomial ideals. Extending results by Sturmfels & Thomas, we...
متن کاملOptimal Gröbner Base Algorithms for Binomial Ideals
Little is known about upper complexity bounds for the normal form algorithms which transform a given polynomial ideal basis into a Grr obner basis. In this paper, we exhibit an optimal, exponential space algorithm for generating the reduced Grr obner basis of binomial ideals. This result is then applied to derive space optimal decision procedures for the nite enumeration and subword problems fo...
متن کاملA Note on Nielsen Reduction and CosetEnumerationBirgit Reinert
Groups can be studied using methods from diierent elds such as combina-torial group theory or string rewriting. Recently techniques from Grr obner basis theory for free monoid rings (non-commutative polynomial rings) respectively free group rings have been added to the set of methods due to the fact that monoid and group presentations (in terms of string rewriting systems) can be linked to spec...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2011